A Hybrid Metaheuristic for Project Scheduling Problems with Fuzzy Activity Durations to support the Ős-Dráva Water Management Programme

نویسندگان

  • S. Danka
  • A. Csébfalvi
چکیده

Spatial developmental programs in Hungary are important to support economically lagging regions. As a result of their nature they can be considered as big projects, with long timescales, high levels of capital, causing significant impact on the targeted field. For an effective performance, an accurate planning phase is essentially important. In this paper we concentrate on the project scheduling element of planning, to reduce risk and gain knowledge on the possible, net present value and makespans. The Ős-Dráva program is a water-management based spatial development program. There have been no reference projects like this in Hungary that can support the scheduling of the problem with applicable information. This means that a highly uncertain case is considered with resource constraints implied. Our goal is to support the programme with an appropriate project scheduling method, resulting in a reliable makespan. For this we present a stochastic programming model and a hybrid metaheuristic for resource constrained project scheduling problems. The stochastic programming model was presented by Goel and Grossman[1], considering the net present value of subprojects. The hybrid metaheuristic was presented by Danka [2] which is a modification of the model developed by Csébfalvi [3]. In the presented approach, it is assumed that each activity duration is considered as a fuzzy variable which, can be described with an appropriate membership function. The heuristic algorithm produces “robust” resource-feasible schedules which are totally immune against uncertainties in the activity durations. The hybrid algorithm presented is based on the “Sounds of Silence” harmony search metaheuristic developed by Csébfalvi et al. [4, 5].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ROBUST RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH UNCERTAIN-BUT-BOUNDED ACTIVITY DURATIONS AND CASH FLOWS II. SOUNDS OF SILENCE: A NEW SAMPLING-BASED HYBRID PRIMARY-SECONDARY CRITERIA HARMONY SEARCH METAHEURISTIC

In this paper, we present a new idea for robust project scheduling combined with a cost-oriented uncertainty investigation. The result of the new approach is a makespan minimal robust proactive schedule, which is immune against the uncertainties in the activity durations and which can be evaluated from a cost-oriented point of view on the set of the uncertain-but-bounded duration and cost param...

متن کامل

A UNIFIED MODEL FOR RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM WITH UNCERTAIN ACTIVITY DURATIONS

In this paper we present a unified (probabilistic/possibilistic) model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations and a concept of a heuristic approach connected to the theoretical model. It is shown that the uncertainty management can be built into any heuristic algorithm developed to solve RCPSP with deterministic activity durations. The esse...

متن کامل

A multi-objective resource-constrained project scheduling problem with time lags and fuzzy activity durations

The resource-constrained project scheduling problem is to find a schedule that minimizes the project duration subject to precedence relations and resource constraints. To further account for economic aspects of the project, one may add an objective of cash nature to the problem. In addition, dynamic nature and variations in real world are known to introduce uncertainties into data. Therefore, t...

متن کامل

ROBUST RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH UNCERTAIN-BUT-BOUNDED ACTIVITY DURATIONS AND CASH FLOWS I. A NEW SAMPLING-BASED HYBRID PRIMARY-SECONDARY CRITERIA APPROACH

This paper, we presents a new primary-secondary-criteria scheduling model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations (UD) and cash flows (UC). The RCPSP-UD-UC approach producing a “robust” resource-feasible schedule immunized against uncertainties in the activity durations and which is on the sampling-based scenarios may be evaluated from a cos...

متن کامل

Three Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint

Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012